Delay-Doppler Channel Estimation in Almost Linear Complexity
نویسندگان
چکیده
منابع مشابه
Delay-Doppler Channel Estimation with Almost Linear Complexity
A fundamental task in wireless communication is channel estimation: Compute the channel parameters a signal undergoes while traveling from a transmitter to a receiver. In the case of delay-Doppler channel, a widely used method is the matched filter algorithm. It uses a pseudo-random waveform of length N, and, in case of non-trivial relative velocity between transmitter and receiver, its computa...
متن کاملAlmost Linear Complexity Methods for Delay-Doppler Channel Estimation
A fundamental task in wireless communication is channel estimation: Compute the channel parameters a signal undergoes while traveling from a transmitter to a receiver. In the case of delay-Doppler channel, i.e., a signal undergoes only delay and Doppler shifts, a widely used method to compute delay-Doppler parameters is the pseudo-random method. It uses a pseudo-random sequence of length N, and...
متن کاملchannel estimation for mimo-ofdm systems
تخمین دقیق مشخصات کانال در سیستم های مخابراتی یک امر مهم محسوب می گردد. این امر به ویژه در کانال های بیسیم با خاصیت فرکانس گزینی و زمان گزینی شدید، چالش بزرگی است. مقالات متعدد پر از روش های مبتکرانه ای برای طراحی و آنالیز الگوریتم های تخمین کانال است که بیشتر آنها از روش های خاصی استفاده می کنند که یا دارای عملکرد خوب با پیچیدگی محاسباتی بالا هستند و یا با عملکرد نه چندان خوب پیچیدگی پایینی...
Spectrum Channel Characterization Using Delay and Doppler Spread Parameters
Abstract—This paper describes a non-blind technique, channel sounder, to characterize a wireless channel. This technique is based on the transmission of a pseudo random sequence through the channel, the calculation of its autocorrelation to estimate the channel impulse response, and from it the calculation of the Delay and Doppler spread parameters. This channel sounder was implemented using GN...
متن کاملAbout the linear complexity of the almost perfect sequences
We calculate the linear complexity of almost perfect binary sequences. Also we study the linear complexity of binary sequences obtained from series of almost perfect ternary sequences and the ternary sequences with two nonzero autocorrelation sidelobe levels. Key–Words: linear complexity, almost perfect sequences
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2013
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2013.2273931